Shortest paths to obstacles for a polygonal car-like robot
نویسنده
چکیده
This paper shows how to compute the nonholonomic distance between a car-like robot of polygonal shape and polygonal obstacles. Adopting an optimal control point of view, we use transversality conditions to get information about the structure of paths that are admissible solutions. With this information, the problem of minimizing the length of a path that is, in general, function of three parameters, is reduced to that of minimizing a function of one variable, namely, the robot final orientation. To solve the problem, we decompose it into three subproblems and find sufficient families of shortest paths solving each of the subproblems.
منابع مشابه
Obstacle Distances and Visibility for Car-Like Robots Moving Forward
This paper deals with distance computation between a car-like robot moving only forward and polygonal obstacles. We propose eecient geometric algorithms to compute the shortest paths to obstacles. We then derive the \visibility" domain in the presence of obstacles , i.e. the set of positions reachable from a starting connguration, by a collision-free shortest path unaffected by the presence of ...
متن کاملObstacle distance for car-like robots
This paper shows how to compute the nonholonomic distance between a point-wise car-like robot and polygonal obstacles. Geometric constructions to compute the shortest paths from a configuration (given orientation and position in the plane of the robot) to a position (i.e., a configuration with unspecified final orientation) are first presented. The geometric structure of the reachable set (set ...
متن کاملBounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of n points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are distanc...
متن کاملPlanning Shortest Bounded-Curvature Paths for a Class of nonholonomic Vehicles Among Obstacles
This paper deals with the problem of planning a path for a robot vehicle amidst obstacles. The kinematics of the vehicle being considered are of the unicycle or car{like type, i.e. are subject to nonholonomic constraints. Moreover, the trajectories of the robot are supposed not to exceed a given bound on curvature, that incorporates physical limitations of the allowable minimum turning radius f...
متن کاملSolving Path Following Problem for Car-Like Robot in the Presence of Sliding Effect via LMI Formulation
One of the main problems of car-like robot is robust path following in the presence of sliding effect. To tackle this problem, a robust mix H2/H∞ static state feedback control method is selected. This method is the well-known linear robust controller which is robust against external disturbance as well as model uncertainty. In this paper, the path following problem is formulated as linear matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999